Local behavior of an iterative framework for generalized equations with nonisolated solutions

نویسنده

  • Andreas Fischer
چکیده

An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 ∈ F(z) + T (z), where T is a multifunction and F is singlevalued, the framework covers methods that, at each step, solve subproblems of the type 0 ∈ A(z, s)+ T (z). The multifunction A approximates F around s. Besides a condition on the quality of this approximation, two other basic assumptions are employed to show Q-superlinear or Q-quadratic convergence of the iterates to a solution. A key assumption is the upper Lipschitz-continuity of the solution set map of the perturbed generalized equation 0 ∈ F(z) + T (z) + p. Moreover, the solvability of the subproblems is required. Conditions that ensure these assumptions are discussed in general and by means of several applications. They include monotone mixed complementarity problems, Karush-Kuhn-Tucker systems arising from nonlinear programs, and nonlinear equations. Particular results deal with error bounds and upper Lipschitz-continuity properties for these problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations

‎In this paper‎, ‎an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed‎. ‎The convergence analysis of the algorithm is investigated‎. ‎We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions‎. ‎Finally‎, ‎some numerical examples are given to demons...

متن کامل

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

A Local Strong form Meshless Method for Solving 2D time-Dependent Schrödinger Equations

This paper deals with the numerical solutions of the 2D time dependent Schr¨odinger equations by using a local strong form meshless method. The time variable is discretized by a finite difference scheme. Then, in the resultant elliptic type PDEs, special variable is discretized with a local radial basis function (RBF) methods for which the PDE operator is also imposed in the local matrices. Des...

متن کامل

Iterative scheme to a coupled system of highly nonlinear fractional order differential equations

In this article, we investigate sufficient conditions for existence of maximal and minimal solutions to a coupled system of highly nonlinear differential equations of fractional order with mixed type boundary conditions. To achieve this goal, we apply monotone iterative technique together with the method of upper and lower solutions. Also an error estimation is given to check the accuracy of th...

متن کامل

‎Finite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 94  شماره 

صفحات  -

تاریخ انتشار 2002